/*
 * Copyright (c) 2006, National ICT Australia
 */
/*
 * Copyright (c) 2007 Open Kernel Labs, Inc. (Copyright Holder).
 * All rights reserved.
 *
 * 1. Redistribution and use of OKL4 (Software) in source and binary
 * forms, with or without modification, are permitted provided that the
 * following conditions are met:
 *
 *     (a) Redistributions of source code must retain this clause 1
 *         (including paragraphs (a), (b) and (c)), clause 2 and clause 3
 *         (Licence Terms) and the above copyright notice.
 *
 *     (b) Redistributions in binary form must reproduce the above
 *         copyright notice and the Licence Terms in the documentation and/or
 *         other materials provided with the distribution.
 *
 *     (c) Redistributions in any form must be accompanied by information on
 *         how to obtain complete source code for:
 *        (i) the Software; and
 *        (ii) all accompanying software that uses (or is intended to
 *        use) the Software whether directly or indirectly.  Such source
 *        code must:
 *        (iii) either be included in the distribution or be available
 *        for no more than the cost of distribution plus a nominal fee;
 *        and
 *        (iv) be licensed by each relevant holder of copyright under
 *        either the Licence Terms (with an appropriate copyright notice)
 *        or the terms of a licence which is approved by the Open Source
 *        Initative.  For an executable file, "complete source code"
 *        means the source code for all modules it contains and includes
 *        associated build and other files reasonably required to produce
 *        the executable.
 *
 * 2. THIS SOFTWARE IS PROVIDED ``AS IS'' AND, TO THE EXTENT PERMITTED BY
 * LAW, ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
 * PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED.  WHERE ANY WARRANTY IS
 * IMPLIED AND IS PREVENTED BY LAW FROM BEING DISCLAIMED THEN TO THE
 * EXTENT PERMISSIBLE BY LAW: (A) THE WARRANTY IS READ DOWN IN FAVOUR OF
 * THE COPYRIGHT HOLDER (AND, IN THE CASE OF A PARTICIPANT, THAT
 * PARTICIPANT) AND (B) ANY LIMITATIONS PERMITTED BY LAW (INCLUDING AS TO
 * THE EXTENT OF THE WARRANTY AND THE REMEDIES AVAILABLE IN THE EVENT OF
 * BREACH) ARE DEEMED PART OF THIS LICENCE IN A FORM MOST FAVOURABLE TO
 * THE COPYRIGHT HOLDER (AND, IN THE CASE OF A PARTICIPANT, THAT
 * PARTICIPANT). IN THE LICENCE TERMS, "PARTICIPANT" INCLUDES EVERY
 * PERSON WHO HAS CONTRIBUTED TO THE SOFTWARE OR WHO HAS BEEN INVOLVED IN
 * THE DISTRIBUTION OR DISSEMINATION OF THE SOFTWARE.
 *
 * 3. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR ANY OTHER PARTICIPANT BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
 * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
 * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <inttypes.h>
#include <ll/ll.h>
#include <check/check.h>
#include "test_libs_ll.h"

int check1[] = { 1, 2, 3, 4, 5, 10, 11, 12, 13, 14, -1 };
int check2[] = { 1, 2, 4, 5, 10, 11, 13, 14, -1 };

START_TEST(test_ll_basic)
{
    struct ll *ll = ll_new();
    struct ll *temp;
    void *val;
    int count;

    ll_add_front(ll, (void *)5);
    ll_add_front(ll, (void *)4);
    ll_add_front(ll, (void *)3);
    ll_add_front(ll, (void *)2);
    ll_add_front(ll, (void *)1);

    ll_add_end(ll, (void *)10);
    ll_add_end(ll, (void *)11);
    ll_add_end(ll, (void *)12);
    ll_add_end(ll, (void *)13);
    ll_add_end(ll, (void *)14);

    // printf("Printing all values...\n");
    for (count = 0, temp = ll->next; temp != ll; count++, temp = temp->next) {
        fail_if(check1[count] == -1, "Too much data in list");
        fail_if(check1[count] != (uintptr_t)temp->data, "Wrong value in list");
    }

    for (temp = ll->next; temp != ll; temp = temp->next) {
        if (temp->data == (void *)3 || temp->data == (void *)12) {
            temp = ll_delete(temp);
        }
    }

    for (count = 0, temp = ll->next; temp != ll; count++, temp = temp->next) {
        fail_if(check2[count] == -1, "Too much data in list");
        fail_if(check2[count] != (uintptr_t)temp->data, "Wrong value in list");
    }

    count = 0;
    for (val = ll_pop(ll); val; val = ll_pop(ll)) {
        fail_if(check2[count] == -1, "Too much data popped");
        fail_if(check2[count] != (uintptr_t)val, "Wrong value in list");
        count++;
    }

    fail_unless(ll->next != NULL, "Data still in list after popping all");
    for (temp = ll->next; temp != ll; temp = temp->next) {
        printf("%" PRIdPTR "\n", (uintptr_t)temp->data);
    }
}
END_TEST 

Suite *
make_test_libs_ll_suite(void)
{
    Suite *suite;
    TCase *tc;

    suite = suite_create("LL tests");
    tc = tcase_create("Core");
    tcase_add_test(tc, test_ll_basic);
    suite_add_tcase(suite, tc);
    return suite;
}
